Non-linear Complexity of the Naor-Reingold Pseudo-random Function
نویسندگان
چکیده
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of the lower bound on the linear complexity of this function that has been obtained by F. Griffin and I. E. Shparlinski.
منابع مشابه
On the Uniformity of Distribution of the NaorIReingold Pseudo-Random Function
We show that the new pseudo-random number function, introduced recently by M. Naor and O. Reingold, possesses one more attractive and useful property. Namely, it is proved that for almost all values of parameters it produces a uniformly distributed sequence. The proof is based on some recent bounds of character sums with exponential functions. ( 2001 Academic Press
متن کاملOn the Construction of Pseudo-Random Permutations: Luby-Racko Revisited
Luby and Racko [27] showed a method for constructing a pseudo-random permutation from a pseudo-random function. The method is based on composing four (or three for weakened security) so called Feistel permutations, each of which requires the evaluation of a pseudo-random function. We reduce somewhat the complexity of the construction and simplify its proof of security by showing that two Feiste...
متن کاملA New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
We present PEP, which is a new construction of a tweakable strong pseudo-random permuta-tion. PEP uses a hash-encrypt-hash approach which has recently been used in the constructionof HCTR. This approach is different from the encrypt-mask-encrypt approach of constructionssuch as CMC, EME and EME∗. The general hash-encrypt-hash approach was earlier used byNaor-Reingold to provide ...
متن کاملGeneralized Diffie-Hellman Modulo a Composite is not Weaker than Factoring
The Diie-Hellman key-exchange protocol may naturally be extended to k > 2 parties. This gives rise to the generalized Diie-Hellman assumption (GDH-Assumption). Naor and Reingold have recently shown an eecient construction of pseudo-random functions and reduced the security of their construction to the GDH-Assumption. In this note, we prove that breaking this assumption modulo a composite would ...
متن کاملSynthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions
A pseudo-random function is a fundamental cryptographic primitive that is essential for encryp-tion, identiication and authentication. We present a new cryptographic primitive called pseudo-random synthesizer and show how to use it in order to get a parallel construction of a pseudo-random function. We show several NC 1 implementations of synthesizers based on concrete intractability assumption...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999